RESEARCH OF LETTERLESS SIGNATURES TO SOLVE IDENTIFICATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
Application of Decoupled Scaled Boundary Finite Element Method to Solve Eigenvalue Helmholtz Problems (Research Note)
A novel element with arbitrary domain shape by using decoupled scaled boundary finite element (DSBFEM) is proposed for eigenvalue analysis of 2D vibrating rods with different boundary conditions. Within the proposed element scheme, the mode shapes of vibrating rods with variable boundary conditions are modelled and results are plotted. All possible conditions for the rods ends are incorporated ...
متن کاملUsing MOLP based procedures to solve DEA problems
Data envelopment analysis (DEA) is a technique used to evaluate the relative efficiency of comparable decision making units (DMUs) with multiple input-output. It computes a scalar measure of efficiency and discriminates between efficient and inefficient DMUs. It can also provide reference units for inefficient DMUs without consideration of the decision makers’ (DMs) preferences. In this paper, ...
متن کاملA Neural Network Model to Solve DEA Problems
The paper deals with Data Envelopment Analysis (DEA) and Artificial Neural Network (ANN). We believe that solving for the DEA efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. In this paper, a new neural network model is used to estimate the inefficiency of DMUs in large datasets.
متن کاملA New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملLearning to Solve Constraint Problems
This paper explains why learning to solve constraint problems is so difficult, and describes a set of methods that has been effective on a broad variety of problem classes. The primary focus is on learning an effective search algorithm as a weighted subset of ordering heuristics. Experiments show the impact of several novel techniques on a variety of problems. When a planning problem is cast as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Criminalistics and Forensics
سال: 2021
ISSN: 0130-2655
DOI: 10.33994/kndise.2020.66.68